Deciding whether a regular language is power-closed is PSPACE-complete
نویسنده
چکیده
A regular language L is power-closed if whenever x ∈ L, also x ∈ L for all k ≥ 1. We show that given a deterministic finite automaton A, it is PSPACE-complete to decide whether the language accepted by A is power-closed.
منابع مشابه
Deciding Definability by Deterministic Regular Expressions
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with c...
متن کاملOperations on Automata with All States Final
A language L is prefix-closed if w ∈ L implies that every prefix of w is in L. It is known that a regular language is prefix-closed if and only if it is accepted by a nondeterministic finite automaton (NFA) with all states final [18]. In the minimal incomplete deterministic finite automaton (DFA) for a prefix-closed language, all the states are final as well. The authors of [18] examined severa...
متن کاملFinite Automata with Time-Delay Blocks (Extended Version)
The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsu...
متن کاملComplexity Bounds for Regular Games
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is PSPACE-complete. This is then used to establish PSPACE-completeness for Emerson-Lei games and for games described by Zielonka DAGs. ...
متن کاملComplexity Bounds for Muller Games
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is Pspace-complete. This is then used to establish Pspacecompleteness for Emerson-Lei games and for games described by Zielonka DAGs. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012